Proof of the 1-Factorization and Hamilton Decomposition Conjectures

ISBN-13: 9781470420253 / Angielski / Miękka / 2016 / 164 str.

Csaba, Bela|||Kuhn, Daniela|||Lo, Allan

Opis

In this paper the authors prove the following results for all sufficiently large $n$: [$1$-factorization conjecture] Suppose that $n$ is even and $Dgeq 2lceil n/4rceil -1$; [Hamilton decomposition conjecture] Suppose that $D ge lfloor n/2 rfloor $; [Optimal packings of Hamilton cycles] Suppose that $G$ is a graph on $n$ vertices with minimum degree $deltage n/2$.

Spis treści

• Introduction
• The two cliques case
• Exceptional systems for the two cliques case
• The bipartite case
• Approximate decompositions
• Bibliography